/**
 * 35. 搜索插入位置
 * https://leetcode.cn/problems/search-insert-position/description/
 */
class Solution3 {
    public int searchInsert(int[] nums, int target) {
        int left = 0, right = nums.length - 1;
        while(left < right) {
            int mid = left + (right - left) / 2;
            int x = nums[mid];
            if(x >= target) right = mid;
            else left = mid + 1;
        }
        if(nums[left] < target) return left + 1;
        return left;
    }
}